A Strong Law for the Largest Nearest-neighbor Link on Normally Distributed Points
نویسندگان
چکیده
Let n points be placed independently in d−dimensional space according to the standard d−dimensional normal distribution. Let dn be the longest edge length for the nearest neighbor graph on these points. We show that lim n→∞ √ log n dn log log n = d √ 2 , d ≥ 2, a.s.
منابع مشابه
Asymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملCriticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graphs
Let n points be placed independently in d−dimensional space according to the density f(x) = Ade−λ‖x‖ α , λ > 0, x ∈ d, d ≥ 2. Let dn be the longest edge length for the nearest neighbor graph on these points. We show that (log n)1−1/αdn − bn converges weakly to the Gumbel distribution where bn ∼ log log n. We also show the strong law result, lim n→∞ (λ−1 log n)1−1/α dn √ log log n → d αλ , a.s. ...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کامل0 M ay 2 00 9 Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor
Let n points be placed independently in d−dimensional space according to the density f(x) = Ade −λ‖x‖α , λ > 0, x ∈ Rd, d ≥ 2. Let dn be the longest edge length of the nearest neighbor graph on these points. We show that (λ−1 log n)dn−bn converges weakly to the Gumbel distribution where bn ∼ (d−1) λα log log n. We also prove the following strong law result for the normalized nearest neighbor di...
متن کاملEstimation of Density using Plotless Density Estimator Criteria in Arasbaran Forest
Sampling methods have a theoretical basis and should be operational in different forests; therefore selecting an appropriate sampling method is effective for accurate estimation of forest characteristics. The purpose of this study was to estimate the stand density (number per hectare) in Arasbaran forest using a variety of the plotless density estimators of the nearest neighbors sampling me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006